Problem solving in a message queuing system in a computer network

ABSTRACT

The present invention provides a method and system for debugging and attending to a problem in a message queuing system in a computer network. A critical level of each connection in a matrix is determined. Criticality levels of different combinations of message queuing system configuration data based upon business criteria are determined. Information from the message queuing system is periodically gathered. The information includes current message queuing configuration data, current message queuing usage values, and current server usage values. Suggestions of different configurations for the current message queuing system are provided. The suggested different configurations are prioritized. The current message queuing system configuration are updated from a prioritized list of the suggested different configurations with a highest criticality level at a top of the list. The problem is debugged according to the prioritized list. Attending to the problem requires first attention as identified by the highest criticality level.

This application is a continuation application claiming priority to Ser.No. 15/585,372, filed May 3, 2017, now U.S. Pat. No. 10,341,463, issuedJul. 2, 2019.

NETWORK TECHNICAL FIELD

The invention relates generally to the field of managing message queuesin a network, and in particular to a method and system for optimizingmessage queue configurations.

BACKGROUND

Prior art systems and methods fail to accurately predict the resilienceand consistency of a message queue system within a computer network.Accordingly, there is a need for improved systems and methods to manageand optimize message queue configurations.

SUMMARY

The present invention provides a method, and associated computer systemand computer program product, for optimizing and updating a messagequeuing system by comparing a current message queuing configuration withvarious message queuing configurations stored in a database,prioritizing the various configurations based upon a criticality levelof components, objects and connections, and submitting a prioritizedlist of suggested configurations for consideration for implementationinto the current message queuing system.

A method, implemented by a server, for setting a message queuing systemconfiguration includes: determining criticality levels of differentcombinations of message queuing system configuration data based uponbusiness criteria; periodically gathering and storing information fromthe message queuing system, including current message queuingconfiguration data, current message queuing usage values and currentserver usage values; periodically analyzing the current message queuingsystem configuration by comparing the current message queuingconfiguration data, current message queuing usage values and currentserver usage values with historical data from a database; and providingsuggestions of different configurations for the current message queuingsystem based upon the analysis and comparison of the configuration andusage data. The central server prioritizes the suggested differentconfigurations of the current message queuing system based uponcriticality levels and then can update the current message queuingsystem configuration from a prioritized list of the suggested differentconfigurations with a highest criticality level at a top of the list.The suggested configuration with the highest criticality level can beapplied, wherein the highest criticality level signifies an objectrequiring first attention when a problem is identified in the messagequeuing system.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a cloud computing environment according to an embodimentof the present invention.

FIG. 2 depicts abstraction model layers according to an embodiment ofthe present invention.

FIG. 3 is a flowchart diagram of a method in accordance with embodimentsof the present invention.

FIG. 4 is a matrix representation of a message queuing system inaccordance with embodiments of the present invention.

FIG. 5 is a diagrammatic representation of parameters used in animplementation of a method of a message queuing system in accordancewith embodiments of the present invention.

FIG. 6 is a block diagram of a computer system for implementing a methodin accordance with embodiments of the present invention.

DETAILED DESCRIPTION

In the following description, specific details are set forth although itshould be appreciated by one of ordinary skill that the presentinvention can be practiced without at least some of the details. In someinstances, known features or processes are not described in detail so asnot to obscure the present invention.

It is to be understood that although this disclosure includes a detaileddescription on cloud computing, implementation of the teachings recitedherein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g., networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported, providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based e-mail).The consumer does not manage or control the underlying cloudinfrastructure including network, servers, operating systems, storage,or even individual application capabilities, with the possible exceptionof limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure that includes anetwork of interconnected nodes.

Referring now to FIG. 1, illustrative cloud computing environment 50 isdepicted. As shown, cloud computing environment 50 includes one or morecloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described herein above, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 1 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 2, a set of functional abstraction layers providedby cloud computing environment 50 (FIG. 1) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 2 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may include applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and prioritizing, recommending and updating amessage queuing system 96.

A message queuing system of a network passes messages betweenapplications or program objects, allowing them to work with each other,and allowing objects and systems running on different computers (e.g.via the Internet) to interact. Message passing may be implemented byvarious mechanisms, including channels, connections and interfaces whichprovide models for interprocess communication and synchronization ofmessage passing. Various applications or programs perform coordinatedfunctions, tasks and activities required or desired by the system or theusers.

A message queue is defined as a list or collection of data in whichmessages within the collection are kept in a particular order. A messagequeue is a linear data structure for an abstract sequential collection.Moreover, message queues are software components used for inter-processcommunication (IPC), or for inter-thread communication within the sameprocess.

Message queues provide an asynchronous communications protocol meaningthat the sender and receiver of the message do not need to interact withthe message queue at the same time. Messages placed onto a message queueare stored until the recipient retrieves them or the message expires.Message queues have implicit or explicit limits on the size of data thatmay be transmitted in a single message and the number of messages thatmay remain outstanding on the queue.

Many implementations of message queues function internally within anoperating system or within an application. Such queues exist for thepurposes of that system only. Other message queue implementations allowthe passing of messages between different computer systems to allowconnections between multiple applications and operating systems. Thesemessage queuing systems typically provide functionality to ensure thatmessages do not get lost or misplaced in the event of a system failure.Implementations often exist as proprietary software provided via aservice, open source software, or a hardware-based solution. Cloud-basedmessage queuing service options are also available.

In a typical message queuing implementation, a system administratorinstalls and configures message queuing software which sets up a messagequeue manager or broker, and defines or names a message queue. Anapplication will register a software routine that watches for messagesplaced onto the message queue. Second and subsequent applications mayconnect to the message queue and transfer messages to it. Thequeue-manager software will store the messages until a receivingapplication connects and calls the registered software routine or themessage expiry time is reached. The receiving application thereuponprocesses the received message in an appropriate manner. The abovedescribed message queuing implementation can also be done via a messagequeuing service.

Terms used in discussing the passing of messages to and from messagequeues include the following list which have substantial effects on thereliability and efficiency of a message queuing system.

-   -   Durability whereby messages may be kept in memory, they may be        written to a disk, or they may be stored in a database.    -   Security policies to address which applications will have access        to which messages within a message queue.    -   Message purging policies to define the lifespan of a message or        message queues, or when a message or message queue should be        deleted.    -   Message filtering per predefined criteria to allow only certain        messages to be communicated, accessed or viewed.    -   Delivery policies to determine whether delivery confirmation of        a message is necessary.    -   Routing policies to determine which servers can access a certain        message queue, manager or message.    -   Batching policies to determine whether messages are delivered        immediately, at a given time, or after a delay.    -   Receipt notification to notify a publisher when some or all        subscribers of a service have received a message.

Mechanisms to predict the resilience and consistency for a messagequeuing setup with respect to an application setup are currentlyunavailable. For any given application if there is a message queuingproblem/issue, then the application impact can be very high dependingupon the middleware setup that is present.

Middleware, i.e. message-oriented middleware or MOM, is software orhardware infrastructure supporting the transmission and receiving ofmessages between distributed systems. The middleware allows applicationmodules to be distributed over heterogeneous platforms and reduces thecomplexity of developing applications that span multiple operatingsystems and network protocols. The middleware creates a distributedcommunications layer that insulates applications from the details ofvarious operating systems and network interfaces.

There are multiple symptoms of problems that can be detected in advancefrom a message queuing standpoint which can help to increase thestability within the message queuing system as well as indirectlyimproving the stability of associated applications. For any applicationinvolved in message queuing setup, there are certain best practices thatcan be followed. However after the application is setup and becomesoperational, there is a need for techniques to help sustain thestability of the application by taking care of the message queuingconsistency and resilience that could alter over time.

Once an application is configured with message queuing capability, thereare few safeguards to ensure long term consistency, reliability andresilience of the message queuing setup. The message queuing systemconfiguration should be checked periodically to ensure proper operation.A knowledge base, i.e. database, is desirable to store historical dataof message queuing and related system parameters when message queuing isdeployed. This knowledge base becomes more application intelligent overtime with the accumulation of different message queuing configurations.

A network, cloud environment or computer system incorporating a messagequeuing system includes a central server which periodically gathersinformation about the network and the corresponding message queuingsystem. The central server gathers and stores information into adatabase, and performs a number of duties as described hereafter.

The central server checks the network consistency of the message queuingsystem to ensure that connection channels between message queues withinthe system are operational with proper internet protocol IP addressesfor packet exchange. Possible network outages or fluctuations that caneffect the message queuing settings are updated in the database so thatthe data is available when necessary for periodic updates.

The central server also checks the object consistency of message queuingwith respect to queue manager details, dead letter queue configurationsand queue limits. The parameters within the database are updated toensure object consistency. There typically can not be one single set offixed parameters that would work properly for all applications runningin the network, since every application has its own features,requirements and behavior. Thus parameters effecting variousapplications would be updated into the database over time duringperiodic checks by the processor of the central server. For example anumber of users of the network/system could change, or behavioralparameters of a running application with respect to certain businessobjectives could change.

A dead letter queue allows software developers to look for commonpatterns and potential software problems by storing messages that meetone or more of the following criteria.

-   -   A message is sent to a queue that does not exist.    -   The queue length limit of the message queue is exceeded.    -   The message length limit exceeded.    -   The message is rejected by another queue exchange.    -   The message reaches a threshold read counter number, because it        is not consumed.

The central server creates a connection matrix of queue managerconnections as illustrated in FIG. 4 and cross-referenced in TABLE Ibelow to identify and categorize all of the connections between messagequeue managers in the system.

TABLE I Connection Criticality Object 1 Object 2 Name Level MQM1 MQM19C1 High MQM7 MQM19 C6 Medium MQM45 MQM31 C14 Medium MQM17 MQM14 C10 Low

The exemplary matrix of FIG. 4 and TABLE I are presented aspartially-filled examples of a matrix and table for a message queuingsystem. Every connection/channel between two queue managers is importantfor full operation of the message queuing system, however certainconnections are more critical than others in that problems (akaincidents or issues) associated with those connections could potentiallycause a network or message system to shutdown. Hence the criticalitylevel of each connection between select message queue managers is loggedas shown in TABLE I.

The parameters listed on the exemplary table can include any objectwhich effects the message queuing system such as, but not limited to, amessage queue manager, a message queue, a channel, connection,interface, cluster or logical message queuing entity.

Problems related to an application define the most critical nodes havinga highest criticality level which is stored in the data base and used toidentify the nodes that are most critical to handle first whenever thereis an issue. This prioritization makes the identification and debuggingof an issue much faster and more accurate, and it ensures that themessage queuing configuration acknowledges nodes which are most criticalto be handled first in problem solving in order to maintain optimalreliability of operation of the message queuing system.

Over time the database is populated with more and more information aboutvarious parameters which effect the message queuing system and relatednetwork applications. When a problem occurs that negatively effects thesystem, its criticality is categorized based upon historical data. Forinstance, if a problem or incident effecting the proper communicationsvia connection C1 between message queue manager 1 (MQM1) and MQM19 couldresult in the entire message queuing system being shut down, then thecriticality level for C1 would be set to “High” as shown in TABLE I.However, if a problem with message queuing between MQM17 and MQM14 viaconnection C10 has a minimal or negligible effect on the network, thenthe criticality level for C10 would be set to “Low” as shown. In anyevent, the knowledge base database is populated over time and thecriticality levels are categorized based upon problems effectingspecific applications.

The central server performs file system verification by checking variousparameters of the file system such as disk space or memory capacity anddisk consistency. Appropriate actions must be taken by the server toprevent file system parameters from negatively impacting the messagequeuing consistency. For instance, the knowledge base could includetime-stamped data to indicate certain periods of time during aday/week/month (e.g. during a backup procedure) when an applicationtypically experiences increases in data volume or cache volume so thatthe system can take appropriate actions to prevent message queuingdisruptions.

The central server checks the central processing unit CPU of the centralserver as well as thread information in order to provide an alert whenthere is an indication that the monitored parameters could disrupt themessage queuing performance. The data base is updated with optimalapplication-specific parameters needed for the message queuing system toperform efficiently.

Each time there is a problem or related issue which effects the messagequeuing system, the corrective action taken to remedy the problem isnoted. The issues and corrective actions taken are then updated in theknowledge base so that the same or a similar corrective action can berecommended as soon as a similar issue occurs.

Based on the parameters mentioned above and the knowledge base when aproblem occurs, the message queuing system issues or flags an alert assoon as possible so that the message queuing administrator and otherrelated administrators can take necessary corrective actions and ensurethat the application does not go down by compromising the messagequeuing consistency and resilience. The recommended corrective actioncan also be recommended in the form of a user readable report.

Improvements over prior art message queuing systems are listed below.

1) Predicting the resilience and consistency of a specific messagequeuing setup/configuration and suggesting taking the necessarycorrective actions to ensure the resilience and consistency of thesystem;

2) Analyzing use patterns such as message queuing object consistency andmatrix connection checks of message queuing links;

3) Adaptability of message queuing to changing applications, as well asappropriate notification and implementation of corrective actions.Changes in the business dynamics of an application can be identified andstored in the knowledge base when periodically polling or gatheringinformation for the message queuing system; and

4) An application specific message queuing configuration is created,updated or recommended for current applications to ensure reliabilityand resilience.

FIG. 5 is a diagrammatic representation of parameters used in animplementation of a method of a message queuing system in accordancewith embodiments of the present invention. The message queuing systemoperates under the direction of a central server 510 of a computernetwork whereby the central server 510 gathers information from the 5areas listed below:

1) Network parameters;

2) Object consistency parameters;

3) Connection parameters (between queue managers);

4) File system parameters; and

5) CPU and thread parameters.

Network Parameters

The server checks all sender channels, sender cluster channels, andreceiver channels for proper configuration of network parameters 502.For example, the Fully Qualified Domain Name (FQDN) for each channel ischecked to determine whether it can be resolved to a numeric IP addresswhich is then pinged to make sure it's working properly. If the IPaddress cannot be pinged or the FQDN cannot be resolved, then a flag,message or alert warns a system administrator that the message queuingis failing. Factors such as slow network response times and poweroutages are additional factors that could lead to the failure of messagequeuing.

Object Consistency Parameters

In order to ensure object consistency, object consistency parameter 504is configured and checked to determine:

a. Whether a queue manager has a dead letter queue;

b. Whether the dead letter queue has a specified maximum message lengththat is less than equal to the specified maximum message length of thequeue manager;

c. Whether any channels, specially receiver channels, have a specifiedmaximum message length that is greater than the specified maximum lengthof the queue manager; and

d. Whether there is a reference from object 1 to object 2 and if so,then confirming that both objects exist.

Connection Parameters

As previously described with respect to FIG. 4 and TABLE I above, apriority list of connection parameters 506 between various queuemanagers can be created based upon the behavior of applications. Thepriority list is sorted and the most critical of the connections arechecked first to ensure that any problem to the application with respectto the queue manager is resolved quickly. This cognitive recognition andsolving by prioritization of criticality levels within the messagequeuing system enables predictions of the most important and frequentcauses of failures, and further provides suggestions of most effectivecorrective actions. The matrix of FIG. 4 and the accuracy of thecriticality levels of various objects and connections will mature withupdates over time and will take into consideration the applicationfeedback data to the message queue. Corrective actions for the messagequeuing system are appropriately applied. The system periodicallyupdates the priority list of TABLE I which includes the criticalitylevels of objects and connections. Hence, changes in the businessdynamics of the application can be identified and the message queuingsystem will mature.

File System Parameters

File system parameters 508 such as, but not limited to, file systemcapacity and outages can affect the message queuing setup/configuration.A file system monitoring application can be used to provide inputs tothe central server which in turn will make decisions based upon themessage queue. This includes file system checks that are relevant formessage queuing only that would be done in order to make the appropriatedecisions on increasing the message queuing stability and in turn theapplication stability.

CPU and Thread Parameters

Message queuing behavior is greatly influenced by CPU and threadbehavior, thus CPU and thread parameters 512 such as CPU usagemonitoring and thread monitoring are performed in a message queuingsystem.

A thread is defined as the smallest sequence of programmed instructionsthat can be managed independently such as by a message queue manager aspart of an operating system. The implementation of threads and processesdiffers between operating systems, but in most cases a thread is acomponent of a process. Multiple threads can exist within one process,executing concurrently and sharing resources such as memory, whiledifferent processes do not share these resources. In particular, thethreads of a process share its executable code and the values of itsvariables at any given time.

Systems with a single processor generally implement multi-threading bytime slicing whereby the CPU switches between different softwarethreads. On a multi-processor or multi-core system, multiple threads canexecute in parallel with every processor or core executing a separatethread simultaneously. On a processor or core with hardware threads,separate software threads can also be executed concurrently by separatehardware threads.

The CPU and thread monitored data is provided to the central serverwhich in turn makes decisions based upon the message queue. Some CPU andthread specific checks are relevant for message queuing only so that thecentral server can make appropriate decisions on increasing the messagequeuing stability and in turn the application stability.

The central server receives message queuing data, includingconfiguration data, from the database or knowledge base 514 whichincludes:

1) Node connection criticality details;

2) Specific parameters for optimal message queuing object consistency;

3) Optimal file system and CPU/thread parameters;

4) Network information and outage details;

5) Mapping of issue resolution details for past incidents; and

6) Details of all incidents that were caused due to message queuing.

The central server makes a list 516 of recommendations and actions basedupon all of the above inputs and data from the knowledge base 514whereby the system administrators can take action to improve thereliability of the message queuing system and in turn the applicationstability. Reports can be provided and customized in any format for theuser or system administrator.

FIG. 3 is a flowchart diagram of a method in accordance with embodimentsof the present invention whereby a processor of a central server of thenetwork or system implements the inventive process as follows.

In step 300 a message queue system is provided which includes aplurality of interconnected message queue managers each managing one ormore message queues whereby each message queue is connected to one ormore different message queue managers via a respective interface. Aninterface uses one or more channels for connections between therespective message queue managers. Interface, channel and connection canbe used interchangeably for the purpose of describing the currentinvention.

Configuration data of objects of a message queuing system includesmessage queue managers, message queues, channels and interfaces whichare stored in a database of the central server in step 302. In step 304the criticality levels of different combinations of message queuingsystem configuration data are determined based upon business criteria.For instance, if the business criteria prioritizes that a specificmessage queue must always be operational without interruption orshut-down, then a High criticality level will be assigned to relatedconfiguration data, objects and connections required to ensure theoperation of the message queue.

In step 306 the central server will periodically gather information fromthe message queuing system, including current message queuingconfiguration data, current message queuing usage values and currentserver usage values, then store the gathered information into thedatabase of the central server. The database can be located anywhere.Also the time intervals for gathering information could vary, e.g. everyhour, once per day, once per week, twice per week, once a month, etc.according to the requirements or constraints of scheduling for aparticular system.

The gathered information is analyzed in step 308 by comparing the mostrecently gathered current message queuing configuration data, currentmessage queuing usage values, current server usage values and/or otherobject values related to message queuing with corresponding data whichhas been previously stored on the database as historical datarepresenting various objects and configurations in the past. Based uponthe analysis and comparison of current message queue systemconfiguration and usage data versus historical data, the central serverwill provide suggestions in step 310 of various different configurationsfor the current message queuing system. The suggested configurations canbe prioritized in step 312 as previously shown in TABLE I whereby thesuggested different configurations of the current message queuing systemare prioritized based upon the criticality levels of each suggestedconfiguration.

Finally in step 314 the current message queuing system configuration canbe updated from the prioritized list of the suggested configurationswhich includes a highest criticality level at a top of the list.Typically the suggested configuration with an object having the highestcriticality level will be used to replace the current configuration. Thehighest criticality level signifies an object requiring first attentionwhen a problem is identified in the message queuing system, so by usingthe priority configuration the system will be postured with awareness ofproper maintenance to keep the message queuing system and relatedapplications at an optimal operational level.

Debugging, awareness and correction of an issue, incident or problem inthe message queuing system according to the inventive method willenlighten the server or other applications and devices to prioritize theproblem solving by requiring first attention to the problem asidentified by the highest criticality level. The central server willperiodically: check and confirm operations, fluctuations and outages inpacket communications between sender and receiver channels of thenetwork; check and confirm the objects of the current message queuingsystem configuration data; and check and confirm file system parametersof the network effecting the current message queue system, such as butnot limited to, memory capacity, processing capacity, and diskconsistency. Moreover the server will check and confirm handling ofmessage queue threads of the message queue system.

FIG. 6 is a block diagram of a computer system for implementing a methodin accordance with embodiments of the present invention. A centralserver 600 includes a processor 608, an input device 606 coupled to theprocessor 608, an output device 610 coupled to the processor 608, andmemory devices 602 and 612 each coupled to the processor 608. The inputdevice 606 may be, inter alia, a keyboard, a mouse, etc. The outputdevice 610 may be, inter alia, a printer, a plotter, a computer screen,a magnetic tape, a removable hard disk, a floppy disk, etc. The memorydevices 602 and 612 may be, inter alia, a hard disk, a floppy disk, amagnetic tape, an optical storage such as a compact disc (CD) or adigital video disc (DVD), a dynamic random access memory (DRAM), aread-only memory (ROM), etc. The memory device 612 includes a computercode 614 which is a computer program that includes computer-executableinstructions. The computer code 614 includes software or programinstructions that may implement an algorithm for implementing methods ofthe present invention. The processor 608 executes the computer code 614.The memory device 602 includes input data 604. The input data 604includes input required by the computer code 614. The output device 610displays output from the computer code 614. Either or both memorydevices 602 and 612 (or one or more additional memory devices not shown)may be used as a computer usable storage medium (or program storagedevice) having a computer readable program embodied therein and/orhaving other data stored therein, wherein the computer readable programincludes the computer code 614. Generally, a computer program product(or, alternatively, an article of manufacture) of the computersystem/device 600 may include the computer usable storage medium (orsaid program storage device). The processor 608 may represent one ormore processors. The memory device 602 and/or the memory device 612 mayrepresent one or more computer readable hardware storage devices and/orone or more memories.

The present invention may be a system, a method, and/or a computerprogram product at any possible technical detail level of integration.The computer program product may include a computer readable storagemedium (or media) having computer readable program instructions thereonfor causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A method for debugging and attending to a problemin a message queuing system in a computer network, said methodcomprising: determining, by a central server, a critical level of eachconnection that is an interface using one or more channels forconnecting message queue managers in a matrix of interconnected messagequeue managers in the message queuing system, wherein each message queuemanager manages one or more message queues, wherein each message queuemanager is connected to one or more different message queue managers inthe matrix via respective connections, wherein a highest critical leveldesignation is for a connection whose failure would shut down themessage queuing system, and wherein a lowest critical level designationis for a connection whose failure would have a minimal or negligibleeffect on the message queuing system; determining, by the centralserver, criticality levels of different combinations of message queuingsystem configuration data based upon business criteria; periodicallygathering, by the central server, information from the message queuingsystem, including current message queuing configuration data, currentmessage queuing usage values and current server usage values, followedby storing, by the central server, the gathered information on thedatabase of the central server; periodically analyzing, by the centralserver, a current message queuing system configuration by comparing thecurrent message queuing configuration data, current message queuingusage values, and current server usage values with historical data fromthe database; providing suggestions, by the central server, of differentconfigurations for the current message queuing system based upon theanalysis and comparison of configuration and usage data; prioritizing,by the central server, the suggested different configurations of thecurrent message queuing system based upon the criticality levels of thesuggested different configurations; updating, by the central server, thecurrent message queuing system configuration from a prioritized list ofthe suggested different configurations with a highest criticality levelat a top of the list, and applying the suggested configuration with thehighest criticality level, wherein the highest criticality levelsignifies an object requiring first attention when a problem isidentified in the message queuing system; and debugging, by the centralserver, the problem according to the prioritized list and attending tothe problem requiring first attention as identified by the highestcriticality level.
 2. The method of claim 1, said method furthercomprising: storing into a database, by the central server of thenetwork, message queuing system configuration data of objects includingthe message queue managers, the message queues, the channels, and theinterfaces.
 3. The method of claim 1, said method further comprising:checking and confirming, by the central server, operations, fluctuationsand outages in packet communications between sender and receiverchannels of the network.
 4. The method of claim 1, said method furthercomprising: checking and confirming, by the central server, the objectsof the current message queuing system configuration data.
 5. The methodof claim 1, said method further comprising: checking and confirming bythe central server file system parameters of the network effecting thecurrent message queue system, said parameters including memory capacity,processing capacity, and disk consistency.
 6. The method of claim 1,wherein said periodically gathering information comprises: checking andconfirming, by the central server, handling of message queue threads ofthe message queue system.
 7. A computer program product, comprising oneor more computer readable hardware storage devices having computerreadable program code stored therein, said program code containinginstructions executable by a computing device to implement a method fordebugging and attending to a problem in a message queuing system in acomputer network, said method comprising: determining, by a centralserver, a critical level of each connection that is an interface usingone or more channels for connecting message queue managers in a matrixof interconnected message queue managers in the message queuing system,wherein each message queue manager manages one or more message queues,wherein each message queue manager is connected to one or more differentmessage queue managers in the matrix via respective connections, whereina highest critical level designation is for a connection whose failurewould shut down the message queuing system, and wherein a lowestcritical level designation is for a connection whose failure would havea minimal or negligible effect on the message queuing system;determining, by the central server, criticality levels of differentcombinations of message queuing system configuration data based uponbusiness criteria; periodically gathering, by the central server,information from the message queuing system, including current messagequeuing configuration data, current message queuing usage values andcurrent server usage values, followed by storing, by the central server,the gathered information on the database of the central server;periodically analyzing, by the central server, a current message queuingsystem configuration by comparing the current message queuingconfiguration data, current message queuing usage values, and currentserver usage values with historical data from the database; providingsuggestions, by the central server, of different configurations for thecurrent message queuing system based upon the analysis and comparison ofconfiguration and usage data; prioritizing, by the central server, thesuggested different configurations of the current message queuing systembased upon the criticality levels of the suggested differentconfigurations; updating, by the central server, the current messagequeuing system configuration from a prioritized list of the suggesteddifferent configurations with a highest criticality level at a top ofthe list, and applying the suggested configuration with the highestcriticality level, wherein the highest criticality level signifies anobject requiring first attention when a problem is identified in themessage queuing system; and debugging, by the central server, theproblem according to the prioritized list and attending to the problemrequiring first attention as identified by the highest criticalitylevel.
 8. The computer program product of claim 7, said method furthercomprising: storing into a database, by the central server of thenetwork, message queuing system configuration data of objects includingthe message queue managers, the message queues, the channels, and theinterfaces.
 9. The computer program product of claim 7, said methodfurther comprising: checking and confirming, by the central server,operations, fluctuations and outages in packet communications betweensender and receiver channels of the network.
 10. The computer programproduct of claim 7, said method further comprising: checking andconfirming, by the central server, the objects of the current messagequeuing system configuration data.
 11. The computer program product ofclaim 7, said method further comprising: checking and confirming by thecentral server file system parameters of the network effecting thecurrent message queue system, said parameters including memory capacity,processing capacity, and disk consistency.
 12. The computer program ofproduct claim 7, wherein the step of periodically gathering informationfurther comprises: checking and confirming, by the central server,handling of message queue threads of the message queue system.
 13. Asystem, comprising a computing device, said computing device comprisingone or more processors, one or more memories, and one or more computerreadable hardware storage devices, said one or more hardware storagedevices containing program code executable by the one or more processorsvia the one or more memories to implement a method for debugging andattending to a problem in a message queuing system in a computer networka problem in a message queuing system in a computer network, the methodcomprising: determining, by a central server, a critical level of eachconnection that is an interface using one or more channels forconnecting message queue managers in a matrix of interconnected messagequeue managers in the message queuing system, wherein each message queuemanager manages one or more message queues, wherein each message queuemanager is connected to one or more different message queue managers inthe matrix via respective connections, wherein a highest critical leveldesignation is for a connection whose failure would shut down themessage queuing system, and wherein a lowest critical level designationis for a connection whose failure would have a minimal or negligibleeffect on the message queuing system; determining, by the centralserver, criticality levels of different combinations of message queuingsystem configuration data based upon business criteria; periodicallygathering, by the central server, information from the message queuingsystem, including current message queuing configuration data, currentmessage queuing usage values and current server usage values, followedby storing, by the central server, the gathered information on thedatabase of the central server; periodically analyzing, by the centralserver, a current message queuing system configuration by comparing thecurrent message queuing configuration data, current message queuingusage values, and current server usage values with historical data fromthe database; providing suggestions, by the central server, of differentconfigurations for the current message queuing system based upon theanalysis and comparison of configuration and usage data; prioritizing,by the central server, the suggested different configurations of thecurrent message queuing system based upon the criticality levels of thesuggested different configurations; updating, by the central server, thecurrent message queuing system configuration from a prioritized list ofthe suggested different configurations with a highest criticality levelat a top of the list, and applying the suggested configuration with thehighest criticality level, wherein the highest criticality levelsignifies an object requiring first attention when a problem isidentified in the message queuing system; and debugging, by the centralserver, the problem according to the prioritized list and attending tothe problem requiring first attention as identified by the highestcriticality level.
 14. The system of claim 13, said method furthercomprising: storing into a database, by the central server of thenetwork, message queuing system configuration data of objects includingthe message queue managers, the message queues, the channels, and theinterfaces.
 15. The system of claim 13, said method further comprising:checking and confirming, by the central server, operations, fluctuationsand outages in packet communications between sender and receiverchannels of the network.
 16. The system of claim 13, said method furthercomprising: checking and confirming, by the central server, the objectsof the current message queuing system configuration data.
 17. The systemof claim 13, said method further comprising: checking and confirming bythe central server file system parameters of the network effecting thecurrent message queue system, said parameters including memory capacity,processing capacity, and disk consistency.
 18. The system of claim 13,wherein the step of periodically gathering information furthercomprises: checking and confirming, by the central server, handling ofmessage queue threads of the message queue system.